Approximation Algorithms for Barrier Sweep Coverage
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Barrier Sweep Coverage
Time-varying coverage, namely sweep coverage is a recent development in the area of wireless sensor networks, where a small number of mobile sensors sweep or monitor comparatively large number of locations periodically. In this article we study barrier sweep coverage with mobile sensors where the barrier is considered as a finite length continuous curve on a plane. The coverage at every point o...
متن کاملOptimal Line-sweep-based Decompositions for Coverage Algorithms
Robotic coverage is the problem of moving a sensor or actuator over all points in a given region. Ultimately, we want a coverage path that minimizes some cost such as time. We take the approach of decomposing the coverage region into subregions, selecting a sequence of those subregions, and then generating a path that covers each subregion in turn. In this paper, we focus on generating decompos...
متن کاملApproximation Algorithms for Minimizing Maximum Sensor Movement for Line Barrier Coverage in the Plane
Given a line barrier and a set of mobile sensors distributed in the plane, the Minimizing Maximum Sensor Movement problem (MMSM) for line barrier coverage is to compute relocation positions for the sensors in the plane such that the barrier is entirely covered by the monitoring area of the sensors while the maximum relocation movement (distance) is minimized. Its weaker version, decision MMSM i...
متن کاملNew Algorithms for Barrier Coverage with Mobile Sensors
Monitoring and surveillance are important aspects in modern wireless sensor networks. In applications of wireless sensor networks, it often asks for the sensors to quickly move from the interior of a specified region to the region’s perimeter, so as to form a barrier coverage of the region. The region is usually given as a simple polygon or even a circle. In comparison with the traditional conc...
متن کاملPoint Sweep Coverage on Path
An important application of wireless sensor networks is the deployment of mobile sensors to periodically monitor (cover) a set of points of interest (PoIs). The problem of Point Sweep Coverage is to deploy fewest sensors to periodically cover the set of PoIs. For PoIs in a Eulerian graph, this problem is known NP-Hard even if all sensors are with uniform velocity. In this paper, we study the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2019
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054119500138